package com.dyz.leetcode._20_dynamicProgramming._70;

public class _70_climbStairs01 {
    //超时
    public int climbStairs(int n) {
        return dfs(n);
    }
    private int dfs(int n){
        if(n==1){return 1;}
        if(n==2){return 2;}

        int left = dfs(n-1);
        int right = dfs(n-2);

        return left+right;
    }

}
